Polynomial Time Approximation Schemes and Parameterized Complexity

In this paper, we study the relationship between the approximability and the parameterized complexity of NP optimization problems. We introduce a notion of polynomial fixed-parameter tractability and prove that, under a very general constraint, an NP optimization problem has a fully polynomial time approximation scheme if and only if the problem is polynomial fixed-parameter tractable. By enforcing a constraint of planarity on the W-hierarchy studied in parameterized complexity theory, we obtain a class of NP optimization problems, the planar W-hierarchy, and prove that all problems in this class have efficient polynomial time approximation schemes (EPTAS). The planarW-hierarchy seems to contain most of the known EPTAS problems, and is significantly different from the class introduced by Khanna andMotwani in their efforts in characterizing optimization problems with polynomial time approximation schemes. © 2006 Elsevier B.V. All rights reserved.